Kerdock codes and related planes
نویسنده
چکیده
Kantor, W.M., Kerdock codes and related planes, Discrete Mathematics 106/107 (1992) 297-302. Among the many aspects of coding theory Jack van Lint has studied intensively are some generalizations of Preparata and Kerdock codes (see Baker et al. (1983), Cameron and Van Lint (1991) and Van Lint (1983)). There are still many open problems concerning these. This note is a brief discussion of problems and new results involving orthogonal spreads, translation planes and associated generalized Kerdock codes. 1. Orthogonal spreads Let V be a vector space of dimension 4m over a finite field L of characteristic 2, where m 2 2. Assume that V is equipped with a quadratic form Q of Witt index 2m; the associated bilinear form is denoted (u, u). Then the pair V, Q is equivalent to the pair L4m, Qdm, where Write the standard ordered basis of L4m as e,, . . . , ezm,fi, . . . ,hrn, so that Qdm(ei) = Q4,Jfi) = (ei, ej) = (5, fi) = 0 and (e,, fi) = 6, for 1 c i, i s 2m. We will be concerned with totally singular 2m-spaces. Examples of these are E = (e,, . . .,ezm) andF=(f,,.. . , hm). Each totally singular 2m-space having only 0 in common with E looks like with M a skew-symmetric 2m x 2m matrix (1.1) Correspondence to: W.M. Kantor, Department of Mathematics, University of Oregon, Eugene, OR 97403, USA. * Supported in part by NSF and NSA grants. 0012-365X/92/$05.OOQ 1992-Elsevier Science Publishers B.V. All rights reserved
منابع مشابه
Spreads , Translation Planes and Kerdock Sets
In an orthogonal vector space of type l)/(4n, q), a spread is a family of q2n-l+ totally singular 2n-spaces which induces a partition of the singular points; these spreads are closely related to Kerdock sets. In a 2m-dimensional vector space over GF(q), a spread is a family of q + subspaces of dimension m which induces a partition of the points of the underlying projective space; these spreads ...
متن کاملThe Z4-linearity of Kerdock, Preparata, Goethals, and related codes
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z4, the integers mod 4 (although this requires a slight modificat...
متن کاملAssociation schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
H. Cohn et. al. proposed an association scheme of 64 points in R which is conjectured to be a universally optimal code. We show that this scheme has a generalization in terms of Kerdock codes, as well as in terms of maximal real mutually unbiased bases. These schemes also related to extremal line-sets in Euclidean spaces and Barnes-Wall lattices. D. de Caen and E. R. van Dam constructed two inf...
متن کامل4 - Linearity of Kerdock , Preparata , Goethals and Related Codes ∗
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over 4, the integers mod 4 (although this requires a slight modificati...
متن کاملAn Exponential Number of Generalized Kerdock Codes
If a subcode of the second order Reed-Mul ler code of length 2 ~ has minimum distance 2 ~ ~ 2 (1/2)~-~ then it has at most 2 2~ words. A generalized Kerdock code is defined to be such a subcode in which this max imum is attained. Such codes were first constructed by Kerdock [7]. His codes are extended cyclic codes, in the sense that there is an au tomorphism of order 2" 1 fixing one coordinate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 106-107 شماره
صفحات -
تاریخ انتشار 1992